Doubly equivalent designs

نویسنده

  • M. Liang
چکیده

Mendelsohn and Liang, in J. Combin. Des. 11 (2003), introduced a new class of difference sets and designs: (v, k, [λ1, λ2, . . . , λm])-difference sets and (v, k, [λ1, λ2, . . . , λm])-designs, and mainly discussed designs with a relationship called λ-equivalence. In this paper, we introduce the concepts of a doubly equivalent design as well as a super class. We describe the structure of super classes and discuss properties of doubly equivalent designs. We generalize results of simply equivalent designs in the paper of Mendelsohn and Liang to doubly equivalent designs. The main result is Theorem 3.7, which claims that a particular class of doubly equivalent designs can produce singly equivalent designs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equivalent circuit for the brushless doubly fed machine (BDFM) including parameter estimation and experimental verification

Experimental results from a frame size 180 brushless doubly fed (induction) machine (BDFM) fitted with four rotor designs are presented. The machine is intended for use as a variable speed generator, or drive. A per phase equivalent circuit for the machine has been developed and a method of obtaining parameters for the circuit is described. Expressions for the torque as a function of speed have...

متن کامل

On a 5-design related to a putative extremal doubly even self-dual code of length a multiple of 24

By the Assmus and Mattson theorem, the codewords of each nontrivial weight in an extremal doubly even self-dual code of length 24m form a self-orthogonal 5-design. In this paper, we study the codes constructed from self-orthogonal 5-designs with the same parameters as the above 5-designs. We give some parameters of a self-orthogonal 5-design whose existence is equivalent to that of an extremal ...

متن کامل

A Method for Classification of Doubly Resolvable Designs and Its Application

The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs with an additional property—they have resolutions which are mutually orthogonal. Such designs are called doubly resolvable. Their specific properties can be used in statistical and cryptographic applications. Therefore the classification of doubly resol...

متن کامل

Doubly adaptive biased coin designs with de- layed responses

In clinical studies, patients are usually accrued sequentially, and, in such cases, response-adaptive designs are useful tools to generate treatment allocation schemes in which the assignment of a treatment to an incoming patient is a function of the observed treatment responses thus far. It has been shown that among the various classes of designs, doubly adaptive biased coin designs have sever...

متن کامل

On classifying finite edge colored graphs with two transitive automorphism groups

This paper classifies all finite edge colored graphs with doubly transitive automorphism groups. This result generalizes the classification of doubly transitive balanced incomplete block designs with 1 and doubly transitive one-factorizations of complete graphs. It also provides a classification of all doubly transitive symmetric association schemes. The classification of finite simple groups i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2004